Lexicographic domination in extensive games
نویسندگان
چکیده
منابع مشابه
Lexicographic composition of simple games
A two-house legislature can often be modelled as a proper simple game whose outcome depends on whether a coalition wins, blocks or loses in two smaller proper simple games. It is shown that there are exactly ve ways to combine the smaller games into a larger one. This paper focuses on one of the rules, lexicographic composition, where a coalition wins in G1 ) G2 when it either wins in G1, or b...
متن کاملRainbow domination in the lexicographic product of graphs
A k-rainbow dominating function of a graph G is a map f from V (G) to the set of all subsets of {1, 2, . . . , k} such that {1, . . . , k} = ⋃ u∈N(v) f(u) whenever v is a vertex with f(v) = ∅. The k-rainbow domination number of G is the invariant γrk(G), which is the minimum sum (over all the vertices of G) of the cardinalities of the subsets assigned by a k-rainbow dominating function. We focu...
متن کاملDomination games and treewidth
The r-domination search game on graphs is a game-theoretical approach to several graph and hypergraph parameters including treewidth and hypertree width. The task is to identify the minimum number of cops sufficient to catch the visible and very fast robber. To catch the robber, at least one of the cops should be within at most r edges from him. We give a constant factor approximation algorithm...
متن کاملDistance d-Domination Games
We study graph searching games where a number of cops try to capture a robber that is hiding in a system of tunnels modelled as a graph. While the current position of the robber is unknown to the cops, each cop can see a certain radius d around his position. For the case d = 1 these games have been studied by Fomin, Kratsch and Müller [7] under the name domination games. We are primarily intere...
متن کاملBalancedness of Integer Domination Games
In this paper, we consider cooperative games arising from integer domination problem on graphs. We introduce two games, {k}-domination game and its monotonic relaxed game, and focus on their cores. We first give characterizations of the cores and the relationship between them. Furthermore, a common necessary and sufficient condition for the balancedness of both games is obtained by making use o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Game Theory
سال: 1991
ISSN: 0020-7276,1432-1270
DOI: 10.1007/bf01240272